THE 2-LOCAL HAMILTONIAN PROBLEM ENCOMPASSES NP
نویسندگان
چکیده
منابع مشابه
The Complexity of the Local Hamiltonian Problem
The k-LOCAL HAMILTONIAN problem is a natural complete problem for the complexity class QMA, the quantum analog of NP. It is similar in spirit to MAX-k-SAT, which is NPcomplete for k ≥ 2. It was known that the problem is QMA-complete for any k ≥ 3. On the other hand 1-LOCAL HAMILTONIAN is in P, and hence not believed to be QMA-complete. The complexity of the 2-LOCAL HAMILTONIAN problem has long ...
متن کاملHamiltonian index is NP-complete
In this paper we show that the problem to decide whether the hamiltonian index of a given graph is less or equal to a given constant is Research supported by grants No. 1M0545 and MSM 4977751301 of the Czech Ministry of Education. Supported by Nature Science Funds of China under Contract Grant No.: 10671014
متن کاملCS 286 . 2 Lectures 5 - 6 : Introduction to Hamiltonian Complexity , QMA - completeness of the Local Hamiltonian problem
Definition 1. A language L ∈ BQP if there exists a classical polynomial time algorithm A that maps inputs x ∈ {0, 1}∗ to quantum circuits Cx on n = poly(|x|) qubits, where the circuit is considered a sequence of unitary operators each on 2 qubits, i.e Cx = UTUT−1...U1 where each Ui ∈ L ( C2 ⊗C2 ) , such that: i. Completeness: x ∈ L⇒ Pr(Cx accepts |0n〉) ≥ 2 3 ii. Soundness: x 6∈ L⇒ Pr(Cx accepts...
متن کاملThe NP-Completeness of the Hamiltonian Cycle Problem in Planar Digraphs with Degree Bound Two
The notation and terminology follow Harary [4 1. A hamiltonian cycle in a graph or digraph is a cycle containing all the points. Thus any such cycle has p points as well asp lines (arcs) if the graph (digraph) has p points. No elegant characterization of the graphs or digraphs which possess hamiltonian cycies exists, although the problem is at least one hundred years old [4]. As the problem is ...
متن کاملThe P versus NP Problem
The P versus NP problem is to determine whether every language accepted by some nondeterministic algorithm in polynomial time is also accepted by some (deterministic) algorithm in polynomial time. To define the problem precisely it is necessary to give a formal model of a computer. The standard computer model in computability theory is the Turing machine, introduced by Alan Turing in 1936 [Tur3...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Quantum Information
سال: 2003
ISSN: 0219-7499,1793-6918
DOI: 10.1142/s021974990300022x